Abstract Complexity Definition
نویسندگان
چکیده
منابع مشابه
Abstract Syntax Can Make the Definition of Modelica Less Abstract
Syntax Can Make the Definition of Modelica Less Abstract David Broman and Peter Fritzson Department of Computer and Information Science Linköping University, Sweden {davbr,petfr}@ida.liu.se Abstract. Modelica is an open standardized language used for modeling and simulation of complex physical systems. The language specifiModelica is an open standardized language used for modeling and simulatio...
متن کاملConcept and Definition of Complexity
The term complexity is used informally both as a quality and as a quantity. As a quality, complexity has something to do with our ability to understand a system or object — we understand simple systems, but not complex ones. On another level, complexity is used as a quantity, when we talk about something being more complicated than another. In this chapter, we explore the formalisation of both ...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملThe Complexity of Abstract Machines
Machines Glossary. • An abstract machine M is given by states, noted s, and transitions between them, noted ; • A state is given by the code under evaluation plus some data-structures to implement search and substitution, and to take care of names; • The code under evaluation, as well as the other pieces of code scattered in the data-structures, are λ -terms not considered modulo α-equivalence;...
متن کاملDefinition and Existence of Super Complexity Cores
In this paper we deene and study super complexity cores of languages L with respect to classes C with L 6 2 C. A super complexity core S of L can be considered as an innnite set of strings for which the decision problem for L is very hard to solve with respect to the available \resources" xed by C even for algorithms which have to compute the correct result only for all inputs x 2 S. For exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complicity: An International Journal of Complexity and Education
سال: 2011
ISSN: 1710-5668,1710-5668
DOI: 10.29173/cmplct11156